Failures of Categoricity and Compositionality for Intuitionistic Disjunction∗
نویسنده
چکیده
There are at least two reasonable types of logical inferentialism. The first type of inferentialism views the meaning of a connective in proof-theoretic terms, having no truck with ordinary model theory except in its role as an instrument to illuminate various proof-theoretic features of a connective. The second type of inferentialist is more modest, allowing that we have some prior conception of the meaning that the natural deduction rules for a particular connective determine. Such a position would look to the conditions forced by acceptance of a set of rules against a background model theory for an account of connective meaning. This position is moderate, plausible, and problematic. In the case of classical logic, against the presumption of standard extensional semantics, Carnap long ago demonstrated the general failure of proof-rules to induce the intended boolean interpretation of the connectives. There have been a number of attempts to solve this problem by modifying the natural deduction format, but none have achieved anything like a consensus.
منابع مشابه
An Interactive Approach to Proof-Theoretic Semantics
In truth-functional semantics for propositional logics, categoricity and compositionality are unproblematic. This is not the case for proof-theoretic semantics, where failures of both occur for the semantics determined by monological entailment structures for classical and intuitionistic logic. This is problematic for inferentialists, where the meaning of logical constants is supposed to be det...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملElementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic
The size of shortest cut-free proofs of first-order formulas in intuitionistic sequent calculus is known to be non-elementary in the worst case in terms of the size of given sequent proofs with cuts of the same formulas. In contrast to that fact, we provide an elementary bound for the size of cut-free proofs for disjunction-free intuitionistic logic for the case where the cut-formulas of the or...
متن کاملDisjunction Property and Finite Model Property For an Intuitionistic Epistemic Logic
We show finite model property, disjunction property and decidability for an intuitionistic epistemic logic IEC. Intuitionistic logic is originally a formalisation of a single mathematician whose knowledge increases over time. The logic IEC formalises multiple agents that communicate asynchronously and whose knowledge increases over time. Although soundness and strong completeness for IEC for a ...
متن کاملThe Complexity of the Disjunction and ExistentialProperties in
This paper considers the computational complexity of the disjunc-tion and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A _ B, a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013